Some inequalities for planar convex sets containing one lattice point
نویسندگان
چکیده
منابع مشابه
Inequalities for Lattice Constrained Planar Convex Sets
Every convex set in the plane gives rise to geometric functionals such as the area, perimeter, diameter, width, inradius and circumradius. In this paper, we prove new inequalities involving these geometric functionals for planar convex sets containing zero or one interior lattice point. We also conjecture two results concerning sets containing one interior lattice point. Finally, we summarize k...
متن کاملCounting Convex Polygons in Planar Point Sets
Given a set S of n points in the plane, we compute in time O(n) the total number of convex polygons whose vertices are a subset of S. We give an O(m n) algorithm for computing the number of convex k-gons with vertices in S, for all values k = 3; : : : ;m; previously known bounds were exponential (O(ndk=2e)). We also compute the number of empty convex polygons (resp., k-gons, k m) with vertices ...
متن کاملEmpty Convex Hexagons in Planar Point Sets
Erdős asked whether every sufficiently large set of points in general position in the plane contains six points that form a convex hexagon without any points from the set in its interior. Such a configuration is called an empty convex hexagon. In this paper, we answer the question in the affirmative. We show that every set that contains the vertex set of a convex 9-gon also contains an empty co...
متن کاملEmpty convex polygons in planar point sets
The Erdős–Szekeres theorem inspired a lot of research. A frequent topic in this area is the study of the existence of so-called empty convex polygons in finite planar point sets. Let P be a finite set of points in general position in the plane. A convex k-gon G is called a k-hole (or empty convex k-gon) of P , if all vertices of G lie in P and no point of P lies inside G. Frequently we will mea...
متن کاملk-Sets of Convex Inclusion Chains of Planar Point Sets
Given a set V of n points in the plane, we introduce a new number of k-sets that is an invariant of V : the number of k-sets of a convex inclusion chain of V . A convex inclusion chain of V is an ordering (v1, v2, ..., vn) of the points of V such that no point of the ordering belongs to the convex hull of its predecessors. The k-sets of such a chain are then the distinct k-sets of all the subse...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1998
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700032093